全文获取类型
收费全文 | 30660篇 |
免费 | 5006篇 |
国内免费 | 3371篇 |
专业分类
电工技术 | 2077篇 |
综合类 | 3287篇 |
化学工业 | 1196篇 |
金属工艺 | 822篇 |
机械仪表 | 2133篇 |
建筑科学 | 1730篇 |
矿业工程 | 471篇 |
能源动力 | 262篇 |
轻工业 | 458篇 |
水利工程 | 249篇 |
石油天然气 | 582篇 |
武器工业 | 369篇 |
无线电 | 5951篇 |
一般工业技术 | 1716篇 |
冶金工业 | 1146篇 |
原子能技术 | 99篇 |
自动化技术 | 16489篇 |
出版年
2024年 | 84篇 |
2023年 | 525篇 |
2022年 | 1130篇 |
2021年 | 1325篇 |
2020年 | 1358篇 |
2019年 | 969篇 |
2018年 | 862篇 |
2017年 | 1064篇 |
2016年 | 1206篇 |
2015年 | 1471篇 |
2014年 | 2255篇 |
2013年 | 1875篇 |
2012年 | 2475篇 |
2011年 | 2598篇 |
2010年 | 1993篇 |
2009年 | 2061篇 |
2008年 | 2024篇 |
2007年 | 2339篇 |
2006年 | 1982篇 |
2005年 | 1679篇 |
2004年 | 1337篇 |
2003年 | 1240篇 |
2002年 | 979篇 |
2001年 | 767篇 |
2000年 | 573篇 |
1999年 | 501篇 |
1998年 | 394篇 |
1997年 | 305篇 |
1996年 | 241篇 |
1995年 | 222篇 |
1994年 | 192篇 |
1993年 | 168篇 |
1992年 | 137篇 |
1991年 | 73篇 |
1990年 | 69篇 |
1989年 | 75篇 |
1988年 | 56篇 |
1987年 | 28篇 |
1986年 | 26篇 |
1985年 | 34篇 |
1984年 | 39篇 |
1983年 | 44篇 |
1982年 | 39篇 |
1981年 | 36篇 |
1980年 | 29篇 |
1979年 | 23篇 |
1978年 | 26篇 |
1977年 | 27篇 |
1976年 | 23篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
Automatic feature recognition aids downstream processes such as engineering analysis and manufacturing planning. Not all features can be defined in advance; a declarative approach allows engineers to specify new features without having to design algorithms to find them. Naive translation of declarations leads to executable algorithms with high time complexity. Database queries are also expressed declaratively; there is a large literature on optimizing query plans for efficient execution of database queries. Our earlier work investigated applying such technology to feature recognition, using a testbed interfacing a database system (SQLite) to a CAD modeler (CADfix). Feature declarations were translated into SQL queries which are then executed.The current paper extends this approach, using the PostgreSQL database, and provides several new insights: (i) query optimization works quite differently in these two databases, (ii) with care, an approach to query translation can be devised that works well for both databases, and (iii) when finding various simple common features, linear time performance can be achieved with respect to model size, with acceptable times for real industrial models. Further results also show how (i) lazy evaluation can be used to reduce the work performed by the CAD modeler, and (ii) estimating the time taken to compute various geometric operations can further improve the query plan. Experimental results are presented to validate our main conclusions. 相似文献
72.
In this paper, we propose a H.264/AVC compressed domain human action recognition system with projection based metacognitive learning classifier (PBL-McRBFN). The features are extracted from the quantization parameters and the motion vectors of the compressed video stream for a time window and used as input to the classifier. Since compressed domain analysis is done with noisy, sparse compression parameters, it is a huge challenge to achieve performance comparable to pixel domain analysis. On the positive side, compressed domain allows rapid analysis of videos compared to pixel level analysis. The classification results are analyzed for different values of Group of Pictures (GOP) parameter, time window including full videos. The functional relationship between the features and action labels are established using PBL-McRBFN with a cognitive and meta-cognitive component. The cognitive component is a radial basis function, while the meta-cognitive component employs self-regulation to achieve better performance in subject independent action recognition task. The proposed approach is faster and shows comparable performance with respect to the state-of-the-art pixel domain counterparts. It employs partial decoding, which rules out the complexity of full decoding, and minimizes computational load and memory usage. This results in reduced hardware utilization and increased speed of classification. The results are compared with two benchmark datasets and show more than 90% accuracy using the PBL-McRBFN. The performance for various GOP parameters and group of frames are obtained with twenty random trials and compared with other well-known classifiers in machine learning literature. 相似文献
73.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献
74.
基于全景温度场的电力设备在线自动识别与诊断 总被引:1,自引:0,他引:1
75.
In cooperative communications, employing the idle relay node for forwarding data can effectively improve the transmission rate and performance of the wireless networks. Therefore, various relay node selection algorithms are proposed. However, most of the existing algorithms just focus on the benefit caused by relay nodes, while ignoring the negative effect of the backoff duration time which does not exist in direct transmission, when more than one flow compete for the same relay node. To this end, considering both advantage and adverse impact caused by the relay node, we adopt the game-theoretic approach and propose a cooperative transmission strategy based on the Nash equilibrium, named the Nash Equilibrium Cooperative Transmission Strategy (NECTS). The NECTS can not only guarantee the gain of each flow, but also maximize the system performance, and improve the system throughput effectively. Simulation results show that the NECTS can take the advantage of cooperative communications. Meanwhile, it can avoid the unnecessary competition, and its performance outperforms that of the existing methods. 相似文献
76.
77.
78.
针对海战场作战平台中设备繁杂、异构的特点,栅格网络架构将各类作战平台设备以节点形式进行管理,但现有研究中尚缺乏具体的节点接入与迁移实现的流程方法与技术。论文针对上述问题,提出了海战场栅格节点接入与迁移的一种标准化流程与技术的实现方法,并利用仿真软件进行了实例的仿真验证,验证了节点接入与迁移标准化流程的可行性,并证明了其在技术上的可实现性。 相似文献
79.
We propose an approach to recognize trajectory-based dynamic hand gestures in real time for human–computer interaction (HCI). We also introduce a fast learning mechanism that does not require extensive training data to teach gestures to the system. We use a six-degrees-of-freedom position tracker to collect trajectory data and represent gestures as an ordered sequence of directional movements in 2D. In the learning phase, sample gesture data is filtered and processed to create gesture recognizers, which are basically finite-state machine sequence recognizers. We achieve online gesture recognition by these recognizers without needing to specify gesture start and end positions. The results of the conducted user study show that the proposed method is very promising in terms of gesture detection and recognition performance (73% accuracy) in a stream of motion. Additionally, the assessment of the user attitude survey denotes that the gestural interface is very useful and satisfactory. One of the novel parts of the proposed approach is that it gives users the freedom to create gesture commands according to their preferences for selected tasks. Thus, the presented gesture recognition approach makes the HCI process more intuitive and user specific. 相似文献
80.
The capture of an eye image with the occlusion of spectacles in a non-cooperative environment compromises the accuracy in identifying a person in an iris recognition system. This is due to the obstruction of the iris by the frame which tends to produce an incorrect estimation of the initial center of the iris and the pupil during the iris segmentation process. In addition, it also causes incorrect localization of the upper eyelid during the process of iris segmentation and sometimes, the edges of the frame are wrongly identified as the edges of the upper eyelid. A frame detection method which involves the combination of two gradients, namely the Sobel operator and high pass filter, followed by fuzzy logic and the dilation operation of morphological processing is proposed to identify the frame on the basis of different frame factors in the capture of a distant eye image. In addition, a different color space is applied and only a single channel is used for the process of frame detection. The proposed frame detection method provides the highest frame detection rate compared to the other methods, with a detection rate of more than 80.0%. For the accuracy of the iris localization, upper eyelid localization and iris recognition system, the proposed method gives more than 96.5% accuracy compared to the other methods. The index of decidability showed that the proposed method gives more than 2.35 index compared to the existing methods. 相似文献